- 整數(shù)規(guī)劃問題
下載手機(jī)詞典可隨時(shí)隨地查詞查翻譯
integer programming problem中文什么意思
例句與用法
- Many problems of engineering and system are integer or mixed integer programming problems . lt is well known that the problem of integer programming is a np - hard problem , and the method for it is exponential complex
工程、系統(tǒng)問題中有許多問題屬于整數(shù)或混合整數(shù)規(guī)劃問題。眾所周知，線性整數(shù)規(guī)劃問題是np - hard問題，求解該問題的精確解算法具有指數(shù)復(fù)雜性。 - However , signals take effect by the switch of signal phases , which introduces integer control values into the traffic control problem , so the traffic control problem becomes a large - scale mixed integer programming problem , the computation of which requires an exponential - complexity optimiz ation algorithm
但是，信號燈通過相位切換對交叉口進(jìn)行控制，同時(shí)也在交通控制模型中引入了整數(shù)決策變量，使交通控制模型成為一個大規(guī)?；旌险麛?shù)規(guī)劃問題，需要指數(shù)復(fù)雜度的優(yōu)化算法。 - The elip is suitable for the case that the uncontrollable subnet is cascade petri net and some cascade subnets are neither acyclic petri nets nor state graphs , and the main character is that the nonlinear integer program problem is converted into the problem that can be solved by using some standardized mathematical tools
當(dāng)不可控子網(wǎng)是序狀petri網(wǎng)，且無法用整數(shù)規(guī)劃法綜合控制器時(shí)，可使用擴(kuò)展線性整數(shù)規(guī)劃法，該方法的優(yōu)點(diǎn)在于把非線性整數(shù)規(guī)劃轉(zhuǎn)化為可用標(biāo)準(zhǔn)數(shù)學(xué)工具求解的問題。 - Abstract : a new algorithm w - ecop is presented to effect incremental changes on a standard cell layout automatically . this algorithm deals with cell inserting and cell moving based on rows instead of on cells as most placement algorithms usually do . an integer programming problem is formulated to minimize the adjustment on the initial placement and a heuristic method is presented to search for a shifting path so as to optimize the wirelength . test of w - ecop on a group of practical test cases shows that the algorithm can successfully accomplish incremental placement with good quality and high speed
文摘:提出了一種新的增量式布局方法w - ecop來滿足快速調(diào)整布局方案的要求.與以前的以單元為中心的算法不同,算法基于單元行劃分來進(jìn)行單元的插入和位置調(diào)整,在此過程中使對原布局方案的影響最小,并且盡可能優(yōu)化線長.一組從美國工業(yè)界的測試?yán)颖砻?該算法運(yùn)行速度快,調(diào)整后的布局效果好